0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify int \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n071.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 18:04:53 CST 2018
0.00/0.21	% done 6 iterations in 0.004s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(cTHM88_pme, conjecture,
0.00/0.21	  (![U:(a > $o),V:(a > $o)]:
0.00/0.21	     ((![Xx:a]: (U(Xx) => V(Xx))) =>
0.00/0.21	      (![Xx:(a > $o > $o)]:
0.00/0.21	         ((![Xx0:(a > $o)]: (Xx(Xx0) => (![Xx1:a]: (Xx0(Xx1) => U(Xx1))))) =>
0.00/0.21	          (![Xx0:(a > $o)]: (Xx(Xx0) => (![Xx1:a]: (Xx0(Xx1) => V(Xx1)))))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![U:(a > $o),V:(a > $o)]:
0.00/0.21	       ((![Xx:a]: (U(Xx) => V(Xx))) =>
0.00/0.21	        (![Xx:(a > $o > $o)]:
0.00/0.21	           ((![Xx0:(a > $o)]: (Xx(Xx0) => (![Xx1:a]: (Xx0(Xx1) => U(Xx1))))) =>
0.00/0.21	            (![Xx0:(a > $o)]: (Xx(Xx0) => (![Xx1:a]: (Xx0(Xx1) => V(Xx1))))))))))).
0.00/0.21	tff('0', plain, sk_Xx(sk_Xx0), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('1', plain, sk_Xx0(sk_Xx1), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain, ![X1 : a > $o, X2 : a]: (~ X1(X2) | sk_U(X2) | ~ sk_Xx(X1)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X1 : a > $o, X2 : a, X3 : a > $o]:
0.00/0.21	      (X3 != X1 | ~ X1(X2) | sk_U(X2) | ~ sk_Xx(X3)),
0.00/0.21	    inference('ho.purify_applied_variable', [status(thm)], ['2'])).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0 : a > $o]: (~ $true | ~ sk_Xx(X0) | sk_U(sk_Xx1) | X0 != sk_Xx0),
0.00/0.21	    inference('sup-', [status(thm)], ['1', '3'])).
0.00/0.21	tff('5', plain, ![X0 : a > $o]: (X0 != sk_Xx0 | sk_U(sk_Xx1) | ~ sk_Xx(X0)),
0.00/0.21	    inference('simplify', [status(thm)], ['4'])).
0.00/0.21	tff('6', plain, ![X0 : a]: (sk_V(X0) | ~ sk_U(X0)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('7', plain, ~ sk_V(sk_Xx1), inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('8', plain, (~ $true | ~ sk_U(sk_Xx1)),
0.00/0.21	    inference('sup-', [status(thm)], ['6', '7'])).
0.00/0.21	tff('9', plain, ~ sk_U(sk_Xx1), inference('simplify', [status(thm)], ['8'])).
0.00/0.21	tff('10', plain, ![X0 : a > $o]: (~ sk_Xx(X0) | X0 != sk_Xx0),
0.00/0.21	    inference('clc', [status(thm)], ['5', '9'])).
0.00/0.21	tff('11', plain, (~ $true | sk_Xx0 != sk_Xx0),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '10'])).
0.00/0.21	tff('12', plain, $false, inference('simplify', [status(thm)], ['11'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
